A variable neighborhood search algorithm to generate piano fingerings for polyphonic sheet music
نویسندگان
چکیده
منابع مشابه
A variable neighborhood search algorithm to generate piano fingerings for polyphonic sheet music
A piano fingering indicates which finger should play each note in a piece. Such a guideline is very helpful for both amateur and experienced players in order to play a piece fluently. In this paper, we propose a variable neighborhood search algorithm to generate piano fingerings for complex polyphonic music, a frequently encountered case that was ignored in previous research. The algorithm take...
متن کاملA variable neighbourhood search algorithm to generate piano fingerings for polyphonic sheet music
A good piano fingering is essential for pianists to play a piece fluently. Some examples of algorithms to generate a piano fingering automatically can be found in the literature. However, the existing methods can only generate fingerings for small, monophonic piano pieces for the right hand, minimising the difficulty. In this paper, we develop a variable neighbourhood search (VNS) algorithm tha...
متن کاملA Simple Algorithm for Automatic Generation of Polyphonic Piano Fingerings
We present a novel method for assigning fingers to notes in a polyphonic piano score. Such a mapping (called a “fingering”) is of great use to performers. To accommodate performers’ unique hand sha our method relies on a simple, user function. We use dynamic programming to search the space of all possible fingerings for the optimal fingering under this cost function. Despite the simplicity of t...
متن کاملInvestigating Zone Pricing in a Location-Routing Problem Using a Variable Neighborhood Search Algorithm
In this paper, we assume a firm tries to determine the optimal price, vehicle route and location of the depot in each zone to maximise its profit. Therefore, in this paper zone pricing is studied which contributes to the literature of location-routing problems (LRP). Zone pricing is one of the most important pricing policies that are prevalently used by many companies. The proposed problem is v...
متن کاملA Variable Neighborhood Search Algorithm for the Leather Nesting Problem
The leather nesting problem is a cutting and packing optimization problem that consists in finding the best layout for a set of irregular pieces within a natural leather hide with an irregular surface and contour. In this paper, we address a real application of this problem related to the production of car seats in the automotive industry. The high quality requirements imposed on these products...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Transactions in Operational Research
سال: 2015
ISSN: 0969-6016
DOI: 10.1111/itor.12211